On cohomological decomposability of almost–Kähler structures
نویسندگان
چکیده
منابع مشابه
Cohomological properties of ruled symplectic structures
Donaldson’s work on Lefschetz pencils has shown that, after a slight perturbation of the symplectic form and a finite number of blow-ups, any closed symplectic manifold (M,ω) can be expressed as a singular fibration with generic fiber a smooth codimension 2 symplectic submanifold. Thus fibrations play a fundamental role in symplectic geometry. It is then natural to study smooth (nonsingular) ru...
متن کاملthe role of task-based techniques on the acquisition of english language structures by the intermediate efl students
this study examines the effetivenss of task-based activities in helping students learn english language structures for a better communication. initially, a michigan test was administered to the two groups of 52 students majoring in english at the allameh ghotb -e- ravandi university to ensure their homogeneity. the students scores on the grammar part of this test were also regarded as their pre...
15 صفحه اولOn Conditional Decomposability
The requirement of a language to be conditionally decomposable is imposed on a specification language in the coordination supervisory control framework of discrete-event systems. In this paper, we present a polynomial-time algorithm for the verification whether a language is conditionally decomposable with respect to given alphabets. Moreover, we also present a polynomial-time algorithm to exte...
متن کاملthe effect of consciousness-raising activities on learning grammatical structures by iranian guidance school efl learners
abstract the first purpose of this study was to investigate the effect of consciousness-raising (c-r) activities on learning grammatical structures (simple present tense in this case) by iranian guidance school efl learners. the second one was to investigate the effect of gender on learning the simple present tense through c-r activities and tasks. finally, this study aimed to investigate the ...
On Decomposability of Multilinear Sets
We consider the Multilinear set S defined as the set of binary points (x, y) satisfying a collection of multilinear equations of the form yI = ∏ i∈I xi, I ∈ I, where I denotes a family of subsets of {1, . . . , n} of cardinality at least two. Such sets appear in factorable reformulations of many types of nonconvex optimization problems, including binary polynomial optimization. A great simplifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2014
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-2014-12049-1